Refractometric Properties of a TFBG Sensor Demodulated Using α-Shape Modified Delaunay Triangulation
نویسندگان
چکیده
In our previous research, a novel demodulation technique based on α-shape Delaunay triangulation (D-T) was developed to obtain the refractive index of medium surrounding optical fibre using envelope cladding peaks from spectrum tilted Bragg grating (TFBG) sensor. This demonstrated be efficient, easy implement, powerful, faster than ones and applicable for real-time measurements. this paper, deep parametric analysis resolution, repeatability accuracy D-T TFBG refractometer sensor is performed presented. The spectral properties as are explored same technique. Specifically, supposing use two-parameter sensor, influence strain area analysed, measurement stability regarding external RI reported. Then, resonance in observed experimentally undergoes partial immersion defined liquid. last experiment allowed better understanding evolution transmission when gratings were partially surrounded by with different RI.
منابع مشابه
Constrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملFault Tolerance in Wireless Sensor Networks using Stiffed Delaunay Triangulation
Abstract: In this chapter, we introduce fault tolerance in Wireless Sensor Networks. Firstly, we start with a short description of sensor networks, fault tolerance and its different techniques. Then we discuss the different phases of fault tolerance (fault models, fault detection and identification at five levels of abstractions (physical, hardware, middleware, system software and applications)...
متن کاملRobot Motion Using Delaunay Triangulation
Robot motion is nowadays studied from a lot of different perspectives. This paper is based on the assumption of a fully known environment, allowing the supervisor to plan the robot trajectory before the actual motion. The auxiliary structure we mainly use is the Delaunay triangulation. We analyze the implementation details, as well as the limits of the geometrical model we use.
متن کاملDelaunay Triangulation of Manifolds
We present an algorithmic framework for producing Delaunay triangulations of manifolds. The input to the algorithm is a set of sample points together with coordinate patches indexed by those points. The transition functions between nearby coordinate patches are required to be bi-Lipschitz with a constant close to 1. The primary novelty of the framework is that it can accommodate abstract manifo...
متن کاملConstrained Delaunay Triangulation using Plane Subdivision
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm presents a method for inserting edges, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics
سال: 2021
ISSN: ['2328-7810', '2328-7780']
DOI: https://doi.org/10.3390/opt2020012